Flexible Language Constructs for Large Parallel Programs

نویسندگان

  • Matthew Rosing
  • Bobby Schnabel
چکیده

The goal of the research described in this paper is to develop flexible language constructs for writing large data parallel numerical programs for distributed memory (MIMD) multiprocessors. Previously, several models have been developed to support synchronization and comnmnication. Models for global synchronization include SIMD (Single Instruction Multiple Data), SPMD (Single Program Multiple Data), and sequentim programs annotated with data distribution statements. The two primary models for communication include implicit communication based on shared memory and explicit communication based on messages. None of these models by themselves seem sufficient to permit the natural and efficient expression of the variety of algorithms that occur in large scientific computations. In this paper, we give an overview of a new language that combines many of these programming models in a clean manner. This is done in a modular fashion such that different models can be combined to support large programs. Within a module, the selection of a model depends on the algorithm and its efficiency requirements. In this paper, we give an overview of the language and discuss some of the critical implementation details. 1Both authors supported by NSF grant ASC-9015577, NSF grant CDA-8922510 and AFOSR-90-0109 2This research was supported by the National Aeronautics and Space Administration under NASA Contract Nos. NAS1-18605 and NAS1-19480 while the author was in residence at the Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA 23681.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines

Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...

متن کامل

Actor Languages for Speciication of Parallel Computations

We describe high-level language constructs for specifying parallel programs and show how they may be used to provide modular speci-cation of communication, synchronization and placement. The high-level constructs are translated into actors which provide exible low-level primi-tives for interconnecting distributed components and eecient execution on concurrent computers. We argue that our lingui...

متن کامل

Implementing Parallel Language Constructs Using a Re Blockinective Object-oriented Language

To provide various parallel language constructs, extensible languages based on re ection are attractive for both implementors and users. This paper describes our proposed meta-level architecture of a concurrent object-oriented language ABCL/R3, which has the following characteristics: (1) language customization through meta-interpreters and meta-objects, (2) delegation and inheritance mechanism...

متن کامل

Implementing Parallel Language Constructs Using a Re ective Object - Oriented Language

To provide various parallel language constructs, extensible languages based on re ection are attractive for both implementors and users. This paper describes our proposed meta-level architecture of a concurrent object-oriented language ABCL/R3, which has the following characteristics: (1) language customization through meta-interpreters and meta-objects, (2) delegation and inheritance mechanism...

متن کامل

Finite Horizon Economic Lot and Delivery Scheduling Problem: Flexible Flow Lines with Unrelated Parallel Machines and Sequence Dependent Setups

This paper considers the economic lot and delivery scheduling problem in a two-echelon supply chains, where a single supplier produces multiple components on a flexible flow line (FFL) and delivers them directly to an assembly facility (AF). The objective is to determine a cyclic schedule that minimizes the sum of transportation, setup and inventory holding costs per unit time without shortage....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Scientific Programming

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1994